Coloring the Cartesian sum of graphsDER-FEN LIU, Daphne; XUDING ZHU.Discrete mathematics. 2008, Vol 308, Num 24, pp 5928-5936, issn 0012-365X, 9 p.Article

Asymptotic values of the Hall-ratio for graph powersSIMONYI, Gabor.Discrete mathematics. 2006, Vol 306, Num 19-20, pp 2593-2601, issn 0012-365X, 9 p.Article

Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbersBROWN, J. I; HOSHINO, R.Discrete mathematics. 2009, Vol 309, Num 8, pp 2223-2232, issn 0012-365X, 10 p.Article

Resource-sharing system scheduling and circular chromatic numberYEH, Hong-Gwa; XUDING ZHU.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 447-460, issn 0304-3975, 14 p.Article

The incidence game chromatic number of paths and subgraphs of wheels : Game TheoryKIM, John Y.Discrete applied mathematics. 2011, Vol 159, Num 8, pp 683-694, issn 0166-218X, 12 p.Article

Weak acyclic coloring and asymmetric coloring gamesKIERSTEAD, H. A.Discrete mathematics. 2006, Vol 306, Num 7, pp 673-677, issn 0012-365X, 5 p.Article

Some star extremal circulant graphsWENSONG LIN.Discrete mathematics. 2003, Vol 271, Num 1-3, pp 169-177, issn 0012-365X, 9 p.Article

Hall ratio of the Mycielski graphsCROPPER, Mathew; GYARFAS, Andras; LEHEL, Jenö et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1988-1990, issn 0012-365X, 3 p.Article

Minimum chromaticity of circulant graphsOBRADOVIC, Nenad; PETERS, Joseph; RUZIC, Goran et al.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 288-296, issn 0012-365X, 9 p.Article

A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2KEFENG DIAO; GUIZHEN LIU; RAUTENBACH, Dieter et al.Discrete mathematics. 2006, Vol 306, Num 7, pp 670-672, issn 0012-365X, 3 p.Article

The Erdos-Faber-Lovasz conjecture for dense hypergraphsSANCHEZ-ARROYO, Abdon.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 991-992, issn 0012-365X, 2 p.Conference Paper

Vertex-, edge-, and total-colorings of Sierpinski-like graphsJAKOVAC, Marko; KLAVZAR, Sandi.Discrete mathematics. 2009, Vol 309, Num 6, pp 1548-1556, issn 0012-365X, 9 p.Article

[r, s, t]-Colorings of graphsKEMNITZ, Amfried; MARANGIO, Massimiliano.Discrete mathematics. 2007, Vol 307, Num 2, pp 199-207, issn 0012-365X, 9 p.Article

The fractional chromatic number, the Hall ratio, and the lexicographic productJOHNSON, P. D.Discrete mathematics. 2009, Vol 309, Num 14, pp 4746-4749, issn 0012-365X, 4 p.Article

List coloring of graphs having cycles of length divisible by a given numberAKBARI, S; GHANBARI, M; JAHANBEKAM, S et al.Discrete mathematics. 2009, Vol 309, Num 3, pp 613-614, issn 0012-365X, 2 p.Conference Paper

5-chromatic strongly regular graphsFIALA, Nick C; HAEMERS, Willem H.Discrete mathematics. 2006, Vol 306, Num 23, pp 3083-3096, issn 0012-365X, 14 p.Conference Paper

Colourings of graphs with two consecutive odd cycle lengthsCAMACHO, Stephan Matos; SCHIERMEYER, Ingo.Discrete mathematics. 2009, Vol 309, Num 15, pp 4916-4919, issn 0012-365X, 4 p.Conference Paper

An inequality for the group chromatic number of a graphLAI, Hong-Jian; XIANGWEN LI; GEXIN YU et al.Discrete mathematics. 2007, Vol 307, Num 23, pp 3076-3080, issn 0012-365X, 5 p.Article

A generalization of the Erdös-Ko-Rado theoremALISHAHI, Meysam; HAJIABOLHASSAN, Hossein; TAHERKHANI, Ali et al.Discrete mathematics. 2010, Vol 310, Num 1, pp 188-191, issn 0012-365X, 4 p.Article

5-Chromatic even triangulations on surfacesNAKAMOTO, Atsuhiro.Discrete mathematics. 2008, Vol 308, Num 12, pp 2571-2580, issn 0012-365X, 10 p.Article

New approximation guarantee for chromatic numberARORA, Sanjeev; CHLAMTAC, Eden; CHARIKAR, Moses et al.Annual ACM symposium on theory of computing. 2006, pp 215-224, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper

Coloring vertices and faces of maps on surfacesKORZHIK, Vladimir P.Discrete mathematics. 2010, Vol 310, Num 19, pp 2504-2509, issn 0012-365X, 6 p.Article

On b-colorings in regular graphsBLIDIA, Mostafa; MAFFRAY, Frédéric; ZEMIR, Zoham et al.Discrete applied mathematics. 2009, Vol 157, Num 8, pp 1787-1793, issn 0166-218X, 7 p.Article

Relaxed very asymmetric coloring gamesDAQING YANG.Discrete mathematics. 2009, Vol 309, Num 5, pp 1043-1050, issn 0012-365X, 8 p.Conference Paper

Some relations among term rank, clique number and list chromatic number of a graphAKBARI, Saieed; FANHI, Hamid-Reza.Discrete mathematics. 2006, Vol 306, Num 23, pp 3078-3082, issn 0012-365X, 5 p.Conference Paper